#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repp(i, n) for(int i = 1; i <= n; ++i)
#define forr(i, l, r) for(int i = l; i <= r; ++i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int n, a[200005];
queue<int> q;
void SOLVE() {
    cin >> n;
    rep(i, n) cin >> a[i];
    sort(a, a + n);
    rep(i, n) {
        if(!q.empty() && q.front() != a[i]) q.pop();
        q.push(a[i]); 
    }
    cout << q.size();
}
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    SOLVE();
    return 0;
}